Selberg’s sieve of irregular density
نویسندگان
چکیده
We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets primes. derive new results for lower bound sieve suited especially this setup and we apply them to give a sieve-propelled proof o
منابع مشابه
Sieve M Inference on Irregular Parameters
This paper presents sieve inferences on possibly irregular (i.e., slower than root-n estimable) functionals of semi-nonparametric models with i.i.d. data. We provide a simple consistent variance estimator of the plug-in sieve M estimator of a possibly irregular functionals, which implies that the sieve t statistic is asymptotically standard normal. We show that, even for hypothesis testing of i...
متن کاملA Large Sieve Zero Density Estimate for Maass Cusp Forms
A Large Sieve Zero Density Estimate for Maass Cusp Forms Paul Dunbar Lewis The large sieve method has been used extensively, beginning with Bombieri in 1965, to provide bounds on the number of zeros of Dirichlet L-functions near the line σ = 1. Using the Kuznetsov trace formula and the work of Deshouillers and Iwaniec on Kloosterman sums, it is possible to derive large sieve inequalities for th...
متن کاملthe effect of creative writing instruction on lexical density of advanced efl learners writing
چکیده ندارد.
15 صفحه اولBayesian adaptive bandwidth kernel density estimation of irregular multivariate distributions
Kernel density estimation is an important technique for understanding the distributional properties of data. Some investigations have found that the estimation of a global bandwidth can be heavily affected by observations in the tail. We propose to categorize data into lowand high-density regions, to which we assign two different bandwidths called the low-density adaptive bandwidths. We derive ...
متن کاملDesign of capacity-approaching irregular low-density parity-check codes
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the underlying communication channel is symmetric, we prove that the probability densities at the message...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2022
ISSN: ['0065-1036', '1730-6264']
DOI: https://doi.org/10.4064/aa220719-5-10